Search results for "Irregularity strength"

showing 1 items of 1 documents

The irregularity strength of circulant graphs

2005

AbstractThe irregularity strength of a simple graph is the smallest integer k for which there exists a weighting of the edges with positive integers at most k such that all the weighted degrees of the vertices are distinct. In this paper we study the irregularity strength of circulant graphs of degree 4. We find the exact value of the strength for a large family of circulant graphs.

CombinatoricsDiscrete mathematicsCirculant graphSimple graphIntegerLabelingDiscrete Mathematics and CombinatoricsCirculant matrixIrregularity strengthGraphTheoretical Computer ScienceMathematicsDiscrete Mathematics
researchProduct